Reuse of standard preconditioners for higher-order time discretizations of parabolic PDEs
نویسندگان
چکیده
In this work we study a preconditioned iterative method for some higher–order time discretizations of linear parabolic partial differential equations. We use the Padé approximations of the exponential function to discretize in time and show that standard solution algorithms for lower–order time discretization schemes, such as Crank–Nicolson and implicit Euler, can be reused as preconditioners for the arising linear system. The proposed preconditioner is order optimal with respect to the discretization parameters.
منابع مشابه
Preconditioning of fully implicit Runge-Kutta schemes for parabolic PDEs
Recently, the authors introduced a preconditioner for the linear systems that arise from fully implicit Runge-Kutta time stepping schemes applied to parabolic PDEs [9]. The preconditioner was a block Jacobi preconditioner, where each of the blocks were based on standard preconditioners for low-order time discretizations like implicit Euler or Crank-Nicolson. It was proven that the preconditione...
متن کاملOrder-Optimal Preconditioners for Implicit Runge-Kutta Schemes Applied to Parabolic PDEs
In this paper we show that standard preconditioners for parabolic PDEs discretized by implicit Euler or Crank–Nicolson schemes can be reused for higher–order fully implicit Runge–Kutta time discretization schemes. We prove that the suggested block diagonal preconditioners are order–optimal for A–stable and irreducible Runge–Kutta schemes with invertible coefficient matrices. The theoretical inv...
متن کاملA Posteriori Error Estimates for Nonlinear Problems. L(0, T ;L(Ω))-Error Estimates for Finite Element Discretizations of Parabolic Equations
Using the abstract framework of [10] we analyze a residual a posteriori error estimator for space-time finite element discretizations of parabolic pdes. The estimator gives global upper and local lower bounds on the error of the numerical solution. The finite element discretizations in particular cover the so-called θ-scheme, which includes the implicit and explicit Euler methods and the Crank-...
متن کاملApproximate Schur Complement Preconditioning of the Lowest-Order Nodal Discretizations
Certain classes of nodal methods and mixed-hybrid nite element methods lead to equivalent , robust and accurate discretizations of 2 nd order elliptic PDEs. However, widespread popularity of these discretizations has been hindered by the awkward linear systems which result. The present work overcomes this awkwardness and develops preconditioners which yield solution algorithms for these discret...
متن کاملMultilevel preconditioning and low-rank tensor iteration for space-time simultaneous discretizations of parabolic PDEs
This paper addresses the solution of instationary parabolic evolution equations simultaneously in space and time. As a model problem we consider the heat equation posed on the unit cube in Euclidean space of moderately high dimension. An a priori stable minimal residual Petrov-Galerkin variational formulation of the heat equation in space-time results in a generalized least squares problem. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Num. Math.
دوره 14 شماره
صفحات -
تاریخ انتشار 2006